M numbers move through a set of N numbers. We want to get the smallest element of the set

There are N sets and M numbers that are different from each other and move from set to set. We want to get the smallest number in a set.

→ "which set you are in now" is stored separately in an array of size M. When leaving a set, it is not deleted from heapq. Same code for adding and moving. When retrieving an element, skip the elements that are not in the set.

code:python

N = 2

M = 2

items = [[] for _ in range(N)]

def put(id, pos):

move = put

def top(pos):

while q:

heappop(q)

continue

return id

return None

put(0, 0)

put(1, 0)

move(0, 1)

print(top(0)) # => 1

move(0, 0)

print(top(0)) # => 0

move(0, 1)

print(top(0)) # => 1

---